A Note on Amortized Space Complexity
نویسنده
چکیده
In this note, we show that while almost all functions require exponential size branching programs to compute, for all functions f there is a branching program computing a large number of copies of f which has linear size per copy of f . We then discuss which nonmonotone lower bound approaches for branching programs are ruled out by this result. Acknowledgement: This work was supported by the Simons Foundation and the National Science Foundation. The author would like to thank Avi Wigderson for helpful conversations. .
منابع مشابه
A Note on Amortized Branching Program Complexity
In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions f there is a branching program computing a doubly exponential number of copies of f which has linear size per copy of f . This result disproves a conjecture about non-uniform catalytic computation, rules out a certain type of bottleneck argument for proving non-monoto...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملLong-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput
The (n; k; l)-renaming problem requires that names from the set f1; : : : ; lg are assigned to processes from a set of size n, provided that no more than k l processes are simultaneously either holding or trying to acquire a name. A solution to this problem supplies a renaming object supporting both acquire and release operations so that no two processes ever simultaneously hold the same name. ...
متن کاملQuake Heaps: A Simple Alternative to Fibonacci Heaps
This note describes a data structure that has the same theoretical performance as Fibonacci heaps, supporting decrease-key operations in O(1) amortized time and delete-min operations in O(log n) amortized time. The data structure is simple to explain and analyze, and may be of pedagogical value.
متن کاملAmortized Communication Complexity
In this work we study the direct-sum problem with respect to communication complexity: Consider a relation f deened over f0; 1g n f0; 1g n. Can the communication complexity of simultaneously computing f onìnstances (x 1 ; y 1); : : : ; (x ` ; y `) be smaller than the communication complexity of computing f on thè instances, separately? Let the amortized communication complexity of f be the comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.06632 شماره
صفحات -
تاریخ انتشار 2016